The Unrelated Parallel Machine Scheduling with a Dependent Time Setup using Ant Colony Optimization Algorithm

The unrelated parallel machine scheduling (PMS) problem is essential for the manufacturing industry. Scheduling will save company resources, especially time management. By solving problems quickly and precisely, can get more profit. On that note, this paper focused on PMS problems, which did not consider inherent uncertainty in processing set up by minimizing makespan tardiness. This aimed to minimize tardiness using timing considerations. described how schedule machines Ant Colony Optimization (ACO) Algorithm approach. ACO beneficial parallelism provide fast reasonable solutions. study revealed results of were obtained under a steady condition iteration 30467. be interpreted value close 2.75%. tardiness, delay product delivery consumers anticipated. Moreover, maintain customer satisfaction increase its